Efficient Hybrid Algorithms for Finding Zeros of Convex Functions
نویسندگان
چکیده
منابع مشابه
An Algorithm for Finding All Zeros of Vector Functions
Computing a zero of a continuous function is an old and extensively researched problem in numerical computation. In this paper, we present an efficient subdivision algorithm for finding all real roots of a function in multiple variables. This algorithm is based on a simple computationally verifiable necessity test for existence of a root in any compact set. Both theoretical analysis and numeric...
متن کاملGlobally convergent algorithms for finding zeros of duplomonotone mappings
We introduce a new class of mappings, called duplomonotone, which is strictly broader than the class ofmonotonemappings.We study some of themain properties of duplomonotone functions and provide various examples, including nonlinear duplomonotone functions arising from the study of systems of biochemical reactions. Finally,we present three variations of a derivative-free line search algorithm f...
متن کاملJENSEN’S INEQUALITY FOR GG-CONVEX FUNCTIONS
In this paper, we obtain Jensen’s inequality for GG-convex functions. Also, we get in- equalities alike to Hermite-Hadamard inequality for GG-convex functions. Some examples are given.
متن کاملNumerical algorithms for the real zeros of hypergeometric functions
Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying first order linear difference differential equations with continuous coefficients. In order to compute the zeros of arbitrary solutions of the hypergeometric ...
متن کاملGradient algorithms for finding common Lyapunov functions
This paper is concerned with the problem of finding a quadratic common Lyapunov function for a large family of stable linear systems. We present gradient iteration algorithms which give deterministic convergence for finite system families and probabilistic convergence for infinite families.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1994
ISSN: 0885-064X
DOI: 10.1006/jcom.1994.1009